Dynamic programming for computer register allocation

Scope and pur~s~computers and operations research admit to a rich and complex interface. Most examples of problem solving in this domain use both computers and operations research as tools to solve problems[I. 21. In particular, the computer is used as a tool in implementing a solution technique arising from an operations research model. A different aspect of this interface is explored here: operations research methodology is used as an analytical tool for a computer problem. With their widespread use, computers themselves comprise an application area of vital concern. Operations research approaches can be valuable in this regard, as evidenced by queueing models of computer operating systems]31 and mathematical programming models of information systems[4]. In the present work. dynamic programming is used to solve a problem in the optimization of computer programs. Programs written in a high-level language (like FORTRAN) are translated into machine language by a compiler. The general problem is to make this machine language version efficient (i.e.. execute fast and conserve memory). A specific problem of this type-namely. index register allocation-is formulated in this paper. The solution is a dynamic programming-based procedure which could be included in the compiler to generate more efficient programs.